Another note on countable Boolean algebras
نویسنده
چکیده
We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous complementation.
منابع مشابه
The Completeness of the Isomorphism Relation for Countable Boolean Algebras
We show that the isomorphism relation for countable Boolean algebras is Borel complete, i.e., the isomorphism relation for arbitrary countable structures is Borel reducible to that for countable Boolean algebras. This implies that Ketonen’s classification of countable Boolean algebras is optimal in the sense that the kind of objects used for the complete invariants cannot be improved in an esse...
متن کاملDownward Closure of Depth in Countable Boolean Algebras
We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.
متن کاملON THE REPRESENTATION OF <r-COMPLETE BOOLEAN ALGEBRAS
A <r-complete Boolean algebra is a Boolean algebra in which for every sequence of elements a$-, i = l, • • • , there is an element U?an, the countable union of the a», such that aiQU?an for every i, and such that if diQx for every i then U?anQx. The dual operation, countable intersection, can be introduced through complementation, and the distributive law afMJi*'a» = Uf {aC\an) and its dual can...
متن کاملOn hereditary interval algebras
We show that each hereditary interval algebra has a countable density and not conversely. Moreover, we show that, for an interval algebra, having countable density and being subal-gebra of the interval algebra over the real line are equivalent statements. 1. Introduction. Boolean algebras that are generated by subchains, that is, subsets that are linearly ordered under the Boolean partial order...
متن کاملForcing Minimal Extensions of Boolean Algebras
We employ a forcing approach to extending Boolean algebras. A link between some forcings and some cardinal functions on Boolean algebras is found and exploited. We find the following applications: 1) We make Fedorchuk’s method more flexible, obtaining, for every cardinal λ of uncountable cofinality, a consistent example of a Boolean algebra Aλ whose every infinite homomorphic image is of cardin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010